E cient Bayesian Inference for Switching State-Space Models using Particle Markov Chain Monte Carlo Methods
نویسندگان
چکیده
Switching state-space models (SSSM) are a popular class of time series models that have found many applications in statistics, econometrics and advanced signal processing. Bayesian inference for these models typically relies on Markov chain Monte Carlo (MCMC) techniques. However, even sophisticated MCMC methods dedicated to SSSM can prove quite ine cient as they update potentially strongly correlated variables one-at-a-time. Particle Markov chain Monte Carlo (PMCMC) methods are a recently developed class of MCMC algorithms which use particle lters to build e cient proposal distributions in high-dimensions [1]. The existing PMCMC methods of [1] are applicable to SSSM, but are restricted to employing standard particle ltering techniques. Yet, in the context of SSSM, much more e cient particle techniques have been developed [22, 23, 24]. In this paper, we extend the PMCMC framework to enable the use of these e cient particle methods within MCMC. We demonstrate the resulting generic methodology on a variety of examples including a multiple change-points model for well-log data and a model for U.S./U.K. exchange rate data. These new PMCMC algorithms are shown to outperform experimentally state-of-the-art MCMC techniques for a xed computational complexity. Additionally they can be easily parallelized [39] which allows further substantial gains.
منابع مشابه
Particle gibbs with ancestor sampling
Particle Markov chain Monte Carlo (PMCMC) is a systematic way of combining the two main tools used for Monte Carlo statistical inference: sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC). We present a new PMCMC algorithm that we refer to as particle Gibbs with ancestor sampling (PGAS). PGAS provides the data analyst with an off-the-shelf class of Markov kernels that can be used ...
متن کاملParticle filters and Markov chains for learning of dynamical systems
Sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC) methods provide computational tools for systematic inference and learning in complex dynamical systems, such as nonlinear and non-Gaussian state-space models. This thesis builds upon several methodological advances within these classes of Monte Carlo methods. Particular emphasis is placed on the combination of SMC and MCMC in so c...
متن کاملParticle Markov chain Monte Carlo methods
Markov chain Monte Carlo and sequential Monte Carlo methods have emerged as the two main tools to sample from high dimensional probability distributions.Although asymptotic convergence of Markov chain Monte Carlo algorithms is ensured under weak assumptions, the performance of these algorithms is unreliable when the proposal distributions that are used to explore the space are poorly chosen and...
متن کاملBayesian Time Series Analysis
This article describes the use of Bayesian methods in the statistical analysis of time series. The use of Markov chain Monte Carlo methods has made even the more complex time series models amenable to Bayesian analysis. Models discussed in some detail are ARIMA models and their fractionally integrated counterparts, state-space models, Markov switching and mixture models, and models allowing for...
متن کاملBayesian Time Series Analysis
This article describes the use of Bayesian methods in the statistical analysis of time series. The use of Markov chain Monte Carlo methods has made even the more complex time series models amenable to Bayesian analysis. Models discussed in some detail are ARIMA models and their fractionally integrated counterparts, state-space models, Markov switching and mixture models, and models allowing for...
متن کامل